A Tabular Method for Star-Sight Reduction

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Reduction Method of Cogging Torque for Magnetic Gears

Nowadays, magnetic gears (MGs) have become an alternative choice for mechanical gears because of their low maintenance, improved durability, indirect contact between inner and outer rotors, no lubrication, and high efficiency. Generally, although these advantages, MGs suffer from inherent issues, mainly the cogging torque. Therefore, cogging torque mitigation has become an active research area....

متن کامل

Extending Simple Tabular Reduction with Short Supports

Constraint propagation is one of the key techniques in constraint programming, and a large body of work has built up around it. Special-purpose constraint propagation algorithms frequently make implicit use of short supports — by examining a subset of the variables, they can infer support (a justification that a variable-value pair still forms part of a solution to the constraint) for all other...

متن کامل

A Tabular Method for Dynamic Oracles in Transition-Based Parsing

We develop parsing oracles for two transition-based dependency parsers, including the arc-standard parser, solving a problem that was left open in (Goldberg and Nivre, 2013). We experimentally show that using these oracles during training yields superior parsing accuracies on many languages.

متن کامل

STR 2 Optimized Simple Tabular Reduction for Table Constraints ∗ Christophe

Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints and/or to compress their representation. In this paper, we describe an optimization of simple tabular reduction (STR), a technique proposed by J. Ullmann to dynamically maintain the tables of supports when generalized arc consistency (GAC...

متن کامل

Optimization of Simple Tabular Reduction for Table Constraints

Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to compress their representation. We show that simple tabular reduction (STR), a technique proposed by J. Ullmann to dynamically maintain the tables of supports, is very often the most efficient practical approach to enforce genera...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Navigation

سال: 1976

ISSN: 0373-4633,1469-7785

DOI: 10.1017/s0373463300030204